Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request
Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Computing the roots of sparse high–degree polynomials that arise from the study of random simplicial complexes

Subjects: Numerical and Computational Mathematics; Bernstein basis; Applied Mathematics

  • Source: Farouki, Rida T; & Strom, Jeffrey A. (2019). Computing the roots of sparse high–degree polynomials that arise from the study of random simplicial complexes. Numerical Algorithms. doi:

تفاصيل العنوان

×

Guarantees of Riemannian Optimization for Low Rank Matrix Completion

Subjects: Control and Optimization; math.NA; Low-rank approximation

  • Source: Wei, Ke; Cai, Jian-Feng; Chan, Tony F.; & Leung, Shingyu. (2016). Guarantees of Riemannian Optimization for Low Rank Matrix Completion. UC Davis: Department of Mathematics. Retrieved from:

تفاصيل العنوان

×

A matrix lower bound

Subjects: Numerical Analysis; Algebra and Number Theory; Block matrix

  • Source: Grcar, Joseph F.(2002). A matrix lower bound. Lawrence Berkeley National Laboratory. Lawrence Berkeley National Laboratory: Lawrence Berkeley National Laboratory. Retrieved from:

تفاصيل العنوان

×
  • 1-10 of  25 نتائج ل ""condition number""